Application of metaheuristics-based clustering algorithm to item assignment in a synchronized zone order picking system

نویسندگان

  • R. J. Kuo
  • P.-H. Kuo
  • Yi-Ruei Chen
  • Ferani E. Zulvia
چکیده

Warehousing management policy is a crucial issue in logistic management. It must be managed effectively and efficiently to reduce the production cost as well as the customer satisfaction. Synchronized zoning system is a warehousing management policy which aims to increase the warehouse utilization and customer satisfaction by reducing the customer waiting time. This policy divides a warehouse into several zones where each zone has its own picker who can work simultaneously. Herein, item assignment plays an important role since it influences the order processing performance. This study proposes an application of metaheuristic algorithms, namely particle swarm optimization (PSO) and genetic algorithm (GA), for item assignment in synchronized zoning system. The original PSO and GA algorithms are modified so that it is suitable for solving item assignment problem. The datasets with different sizes are used for method validation. Results obtained by PSO and GA are then compared with the result of an existing algorithm. The experimental results showed that PSO and GA can perform better than the existing algorithm. These results also show that PSO has better performance than GA, especially for bigger problems. It proves that item assignment policy obtained by PSO and GA has higher utilization rates than the existing algorithm. © 2016 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary User Clustering Based on Time-Aware Interest Changes in the Recommender System

The plenty of data on the Internet has created problems for users and has caused confusion in finding the proper information. Also, users' tastes and preferences change over time. Recommender systems can help users find useful information. Due to changing interests, systems must be able to evolve. In order to solve this problem, users are clustered that determine the most desirable users, it pa...

متن کامل

Title Order batching and picking in a synchronized zone order picking system

Order picking has been considered as one of the most critical operations in warehouse. In this study, we propose an analytical approximation model based on probability and queueing network theory to analyze order batching and picking area zoning on the mean order throughput time in a synchronized zone picker-to-part order picking system. The resulting model can be easily applied in the design a...

متن کامل

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

متن کامل

Integrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

متن کامل

A Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)

Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Appl. Soft Comput.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2016